On cyclotomic cosets and code constructions
نویسندگان
چکیده
New properties of q-ary cyclotomic cosets modulo n = qm − 1, where q ≥ 3 is a prime power, are investigated in this paper. Based on these properties, the dimension as well as bounds for the designed distance of some families of classical cyclic codes can be computed. As an application, new families of nonbinary Calderbank-Shor-Steane (CSS) quantum codes as well as new families of convolutional codes are constructed in this work. These new CSS codes have parameters better than the ones available in the literature. The convolutional codes constructed here have free distance greater than the ones available in the literature. keywords : cyclotomic cosets; BCH codes; CSS construction
منابع مشابه
GF(2m) Low-Density Parity-Check Codes Derived from Cyclotomic Cosets
Based on the ideas of cyclotomic cosets, idempotents and Mattson-Solomon polynomials, we present a new method to construct GF(2m ), where m > 0 cyclic low-density paritycheck codes. The construction method produces the dual code idempotent which is used to define the parity-check matrix of the low-density parity-check code. An interesting feature of this construction method is the ability to in...
متن کاملGF(2) Low-Density Parity-Check Codes Derived from Cyclotomic Cosets
Based on the ideas of cyclotomic cosets, idempotents and Mattson-Solomon polynomials, we present a new method to construct GF(2m ), where m > 0 cyclic low-density paritycheck codes. The construction method produces the dual code idempotent which is used to define the parity-check matrix of the low-density parity-check code. An interesting feature of this construction method is the ability to in...
متن کاملCYCLIC CODES OF LENTH N OVER ( ) GF q q – CYCLOTOMIC COSETS MODULO N AND APPLICATION OF BURNSIDE ’ S LEMMA
The idea of q cyclotomic cosets modulo n due to carry Huffman and Vera pless is considered in the context of linear codes of length n over ( ) GF q where m q p , p is a prime, 1 m . An explicit formula for the number of q cyclostomes cosets modulo is obtained as an application of the classical Burnsides lemnra. The formula for the number of cyclic codes in ( 1) n n q R F x x is dedu...
متن کاملFamilies of LDPC Codes Derived from Nonprimitive BCH Codes and Cyclotomic Cosets
Low-density parity check (LDPC) codes are an important class of codes with many applications. Two algebraic methods for constructing regular LDPC codes are derived – one based on nonprimitive narrow-sense BCH codes and the other directly based on cyclotomic cosets. The constructed codes have high rates and are free of cycles of length four; consequently, they can be decoded using standard itera...
متن کاملOn optimal constacyclic codes
In this paper we investigate the class of constacyclic codes, which is a natural generalization of the class of cyclic and negacyclic codes. This class of codes is interesting in the sense that it contains codes with good or even optimal parameters. In this light, we propose constructions of families of classical block and convolutional maximum-distance-separable (MDS) constacyclic codes, as we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1511.04359 شماره
صفحات -
تاریخ انتشار 2015